Obstacle-Aware Clock-Tree Shaping During Placement

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel obstacle-aware multiple fan-out symmetrical clock tree synthesis

Clock tree design plays a critical role in improving chip performance and affecting power. In this paper, we propose a novel symmetrical clock tree synthesis algorithm, including tree architecture planning, matching, merging, embedding and buffer insertion. Obstacle-aware placement and routing are also integrated into the algorithm flow. By using NGSPICE simulation for benchmark circuits, our s...

متن کامل

UTPlaceF 2.0: A High-Performance Clock-Aware FPGA Placement Engine

Modern field-programmable gate array (FPGA) devices contain complex clock architectures on top of configurable logics. Unlike application specific integrated circuits (ASICs), the physical structure of clock networks in an FPGA is pre-manufactured and cannot be adjusted to different applications. Furthermore, clock routing resources are typically limited for high-utilization designs. Consequent...

متن کامل

Fail-Aware Clock Synchronization

Internal clock synchronization requires that at any point in time the deviation between any two correct clocks is bounded by an a priori given constant. Due to network partitions, unbounded message transmission and process scheduling delays, internal clock synchronization is impossible to implement in asynchronous systems. We address this problem by proposing a new kind of clock synchronization...

متن کامل

Placement For Clock Period Minimization

A linear program is used to direct the placement of Standard Cells such that the clock period is minimized. Constraints upon the logic path delays and the clock signal arrival times at the flipflops allow multiple signals, corresponding to several clock cycles, to exist simultaneously on the logic signal paths during operation. The linear program constraints relate the clock period to the maxim...

متن کامل

Substrate-aware placement and routing

This paper presents a system which uses the adaptive simulated annealing algorithm to optimize placement of modules (e.g. transistors or subcircuits) and (global) routing between these modules. This is achieved through user-specified performance constraints, precomputed sensitivities of the nodes in the circuit and modeling of substrate effects between modules connected to critical nodes. This ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 2012

ISSN: 0278-0070,1937-4151

DOI: 10.1109/tcad.2011.2173490